Constructing unlabelled lattices
نویسندگان
چکیده
منابع مشابه
Constructing unlabelled lattices
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a stabiliser chain approach for cutting branches of the search space that cannot contain a minimal lattice; to make this work, we grow lattices by adding a new...
متن کاملConstructing Integral Lattices With Prescribed Minimum
Methods for computing integral laminated lattices with prescribed minimum are developed. Laminating is a process of stacking layers of an (n l)-dimensional lattice as densely as possible to obtain an «-dimensional lattice. Our side conditions are: All scalar products of lattice vectors are rational integers, and all lattices are generated by vectors of prescribed minimum (square) length m. For ...
متن کاملAddIntent: A New Incremental Algorithm for Constructing Concept Lattices
An incremental concept lattice construction algorithm, called AddIntent, is proposed. In experimental comparison, AddIntent outperformed a selection of other published algorithms for most types of contexts and was close to the most efficient algorithm in other cases. The current best estimate for the algorithm’s upper bound complexity to construct a concept lattice L whose context has a set of ...
متن کاملA partition-based approach towards constructing Galois (concept) lattices
Galois lattices and formal concept analysis of binary relations have proved useful in the resolution of many problems of theoretical or practical interest. Recent studies of practical applications in data mining and software engineering have put the emphasis on the need for both eÆcient and exible algorithms to construct the lattice. Our paper presents a novel approach for lattice construction ...
متن کاملConstructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the de nition of a variety of association rule bases. Although their joint computation has been studied in concept analysis, no scalable algorithm exists for the task at present. We propose here to reverse a method from the latter eld using a fundamental property of hypergraph theory. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2020
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2018.10.017